Randomness in lattice point problems

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Rational Generating Functions for Lattice Point Problems

We prove that for any fixed d the generating function of the projection of the set of integer points in a rational d-dimensional polytope can be computed in polynomial time. As a corollary, we deduce that various interesting sets of lattice points, notably integer semigroups and (minimal) Hilbert bases of rational cones, have short rational generating functions provided certain parameters (the ...

متن کامل

Improved Convexity Cuts for Lattice Point Problems

The generalized lattice point (GLF) problem provides a formulation that accommodates a var.lety of discrete alternative problems. In this paper we show how to substantlrlly strengthen the convexity cuts for the GLF problem. The new cuts are based on the identification of "synthesized" lattice point conditions to replace those that ordinarily define the cut. The synthesized conditions give an al...

متن کامل

0 Randomness on the Lattice

In this lecture we review recent lattice QCD studies of the statistical properties of the eigenvalues of the QCD Dirac operator. We find that the fluctuations of the smallest Dirac eigenvalues are described by chiral Random Matrix Theories with the global symmetries of the QCD partition function. Deviations from chiral Random Matrix Theory beyond the Thouless energy can be understood analytical...

متن کامل

Mass problems and randomness

A mass problem is a set of Turing oracles. If P and Q are mass problems, we say that P is weakly reducible to Q if every member of Q Turing computes a member of P . We say that P is strongly reducible to Q if every member of Q Turing computes a member of P via a fixed Turing functional. The weak degrees and strong degrees are the equivalence classes of mass problems under weak and strong reduci...

متن کامل

COMPUTATIONAL ENUMERATION OF POINT DEFECT CLUSTERS IN DOUBLE- LATTICE CRYSTALS

The cluster representation matrices have already been successfully used to enumerate close-packed vacancy clusters in all single-lattice crystals [I, 2]. Point defect clusters in double-lattice crystals may have identical geometry but are distinct due to unique atomic postions enclosing them. The method of representation matrices is extended to make it applicable to represent and enumerate ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 2001

ISSN: 0012-365X

DOI: 10.1016/s0012-365x(00)00200-4